Combinatoire alg\'ebrique li\'ee aux ordres sur les permutations

This thesis comes within the scope of algebraic combinatorics and studies problems related to three orders on permutations: the two said weak orders (right and left) and the strong order or Bruhat order. We first look at the action of the symmetric group on multivariate polynomials. By using the divided differences operators, one can obtain some generalisations of the Schur function and form bases of non symmetric multivariate polynomials. This construction is similar to the one of Schur functions and also allows for geometric interpretations. We study more specifically the Grothendieck polynomials which were introduced by Lascoux and Schützenberger. Lascoux proved that a product of these polynomials can be interpreted in terms of a product of divided differences. By developing this product, we reobtain a result of Lenart and Postnikov and also prove that it can be interpreted as a sum over an interval of the Bruhat order. We also present our implementation of multivariate polynomials in Sage. This program allows for formal computation on different bases and also implements many changes of bases. It is based on the action of the divided differences operators. The bases include Schubert polynomials, Grothendieck polynomials and Key polynomials. In a second part, we study the Tamari lattice on binary trees. This lattice can be obtained as a quotient of the weak order. Each tree is associated with the interval of its linear extensions. We introduce a new object called, interval-posets of Tamari and show that they are in bijection with the intervals of the Tamari lattice. Using these objects, we give the recursive formula counting the number of elements smaller than or equal to a given tree. We also give a new proof that the generating function of the intervals of the Tamari lattice satisfies some functional equation given by Chapoton. Our final contributions deals with the m-Tamari lattices. This family of lattices is a generalization of the classical Tamari lattice. It was introduced by Bergeron and Préville-Ratelle and was only known in terms of paths. We give the description of this order in terms of some family of binary trees, in bijection with m+1-ary trees. Thus, we generalize our previous results and obtain a recursive formula counting the number of elements smaller than or equal to a given one and a new proof of the functional equation. We finish with the description of some new ”m” Hopf algebras which are generalizations of the known FQSym on permutations and PBT on binary trees.